Simple random sampling with over-replacement
نویسندگان
چکیده
منابع مشابه
On the Simple Inverse Sampling with Replacement
In this paper we derive some unbiased estimators of the population mean under simple inverse sampling with replacement, using the class of Hansen-Hurwitz and Horvitz-Thompson type estimators and the post-stratification approach. We also compare the efficiency of resulting estimators together with Murthy's estimator. We show that in despite of general belief, the strategy consisting of inverse s...
متن کاملThe splitting design that leads to simple random sampling
Implementing unequal probability sampling, without replacement, is very complex and several methods have been suggested for its performance, including : Midseno design and systematic design. One of the methods that have been introduced by Devil and Tille (1998) is the splitting design that leads to simple random sampling .in this paper by completely explaining the design, with an example, we ha...
متن کاملScalable Simple Random Sampling and Stratified Sampling
Analyzing data sets of billions of records has now become a regular task in many companies and institutions. In the statistical analysis of those massive data sets, sampling generally plays a very important role. In this work, we describe a scalable simple random sampling algorithm, named ScaSRS, which uses probabilistic thresholds to decide on the fly whether to accept, reject, or wait-list an...
متن کاملRandom Sampling over Joins Revisited
Joins are expensive, especially on large data and/or multiple relations. One promising approach in mitigating their high costs is to just return a simple random sample of the full join results, which is sufficient for many tasks. Indeed, in as early as 1999, Chaudhuri et al. posed the problem of sampling over joins as a fundamental challenge in large database systems. They also pointed out a fu...
متن کاملAccelerating weighted random sampling without replacement
Random sampling from discrete populations is one of the basic primitives in statistical computing. This article briefly introduces weighted and unweighted sampling with and without replacement. The case of weighted sampling without replacement appears to be most difficult to implement efficiently, which might be one reason why the R implementation performs slowly for large problem sizes. This p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Planning and Inference
سال: 2011
ISSN: 0378-3758
DOI: 10.1016/j.jspi.2010.06.029